Step of Proof: mul_cancel_in_lt
12,41
postcript
pdf
Inference at
*
1
1
I
of proof for Lemma
mul
cancel
in
lt
:
1.
a
:
2.
b
:
3.
n
:
4. (
n
*
a
) < (
n
*
b
)
5.
(
a
<
b
)
a
<
b
latex
by ((InstLemma `mul_preserves_le` [
b
;
a
;
n
])
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat
C
2:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
False
,
t
T
,
A
B
,
P
Q
,
A
,
x
:
A
.
B
(
x
)
,
S
T
Lemmas
nat
plus
inc
,
mul
preserves
le
origin